l={(n*(n+1))//2:n for n in range(1,1415)}
for _ in [0]*int(input()):
x=int(input())
for i in l:
if i>=x:
break
if x==i-1:
print(l[i]+1)
else:
print(l[i])#include<bits/stdc++.h>
#define int long long int
using namespace std;
int32_t main(){
int t;
cin>>t;
while(t--)
{
int x;
cin>>x;
int count=0;
for(int i=0;i<x;i++)
{
if(count*(count+1)/2<x)
count++;
else
break;
}
if(count*(count+1)/2==x+1)
count++;
cout<<count<<endl;
}
}HILLSEQ Hill Sequence | MAXBRIDGE Maximise the bridges |
WLDRPL Wildcard Replacement | 1221. Split a String in Balanced Strings |
1002. Find Common Characters | 1602A - Two Subsequences |
1555A - PizzaForces | 1607B - Odd Grasshopper |
1084A - The Fair Nut and Elevator | 1440B - Sum of Medians |
1032A - Kitchen Utensils | 1501B - Napoleon Cake |
1584B - Coloring Rectangles | 1562B - Scenes From a Memory |
1521A - Nastia and Nearly Good Numbers | 208. Implement Trie |
1605B - Reverse Sort | 1607C - Minimum Extraction |
1604B - XOR Specia-LIS-t | 1606B - Update Files |
1598B - Groups | 1602B - Divine Array |
1594B - Special Numbers | 1614A - Divan and a Store |
2085. Count Common Words With One Occurrence | 2089. Find Target Indices After Sorting Array |
2090. K Radius Subarray Averages | 2091. Removing Minimum and Maximum From Array |
6. Zigzag Conversion | 1612B - Special Permutation |